Towards Strong Cyclic Planning under Partial Observability

نویسندگان

  • Piergiorgio Bertoli
  • Alessandro Cimatti
  • Marco Pistore
چکیده

Strong Cyclic Planning aims at generating iterative plans that only allow loops so far as there is a chance to reach the goal. The problem is already significantly complex for fully observable domains; when considering partially observable domains, even providing a formal definition is far from straightforward. In this work, we provide a formal definition of Strong Cyclic Planning under Partial Observability, which makes clear how several degrees of solution are possible and equally interesting, depending on the admissible delay between achieving the goal and detecting that it has been achieved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pattern-Database Heuristics for Partially Observable Nondeterministic Planning

Heuristic search is the dominant approach to classical planning. However, many realistic problems violate classical assumptions such as determinism of action outcomes or full observability. In this paper, we investigate how – and how successfully – a particular classical technique, namely informed search using an abstraction heuristic, can be transferred to nondeterministic planning under parti...

متن کامل

Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking

Planning under partial observability is one of the most significant and challenging planning problems. It has been shown to be hard, both theoretically and experimentally. In this paper, we present a novel approach to the problem of planning under partial observability in non-deterministic domains. We propose an algorithm that searches through a (possibly cyclic) and-or graph induced by the dom...

متن کامل

Strong planning under partial observability

Rarely planning domains are fully observable. For this reason, the ability to deal with partial observability is one of the most important challenges in planning. In this paper, we tackle the problem of strong planning under partial observability in nondeterministic domains: find a conditional plan that will result in a successful state, regardless of multiple initial states, nondeterministic a...

متن کامل

Generazione Di Piani Ciclici Con Conoscenza Incompleta E Percezione Generation of Strong Cyclic Plans with Incomplete Information and Sensing

Dealing with incomplete information and sensing is needed in order to design agents that operate in domains where their information acquisition capabilities are restricted and the environment may evolve in unpredictable ways. These representation issues have been studied both by the work on reasoning about actions and from a planning perspective. The aim of this paper is to present a language K...

متن کامل

Generation of Strong Cyclic Plans with Incomplete Information and Sensing

Incomplete information and sensing are needed in order to design agents that operate in domains where their information acquisition capabilities are restricted and the environment may evolve in unpredictable ways. These representation issues, that have been studied by the work on reasoning about actions, are also being addressed from a planning perspective. The aim of this paper is to present a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006